1425A - Arena of Greed - CodeForces Solution

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<numeric>
#include<algorithm>
#include<stack>
//sum of sqaures of natural no--- n(n + 1)(2n + 1)/6
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
typedef vector<pi > vii;
typedef vector<ll> vl;
typedef vector<vi> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl > vll;
const ll mo=(1000000000 + 7);
#define f(i,a,b) for(int i=a;i<b;i++)
#define fm(i,a,b) for(int i=a;i>b;i--)
#define fbe(s) (s.begin(),s.end())
#define fs(p) p.size()
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define it iterator
 int compare(const void* a, const void* b)
{
	const int* x = (int*) a;
	const int* y = (int*) b;
 
	if (*x > *y)
		return 1;
	else if (*x < *y)
		return -1;
 
	return 0;
}

void solve()
{
    ll n;
    cin>>n;
    ll i=0;
    while(n>0)
    {
        if(n==4)
        {
            i+=3;
            break;
        }
        else
        {
            if(n==4)
            {
                i++;
                break;
            }
            if(n%2)
            {
                n=n-1;
                i++;
            }
            else
            {
                if(n%4==0)
                {   
                    n=n-1;
                    i++;
                }
                else
                {
                    i+=n/2;
                    n=n/2;
                }
            }
            if(n==4)
            {
                i++;
                break;
            }
            if(n%2)
            {
                n=n-1;
            }
            else
            {
                if(n%4==0)
                {   
                    n=n-1;
                }
                else
                {
                    n=n/2;
                }
            }
        }
    }
    cout<<i<<endl;
    
}
 
 
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    cin>>t;
    while(t-->0)
    {
        solve();
    }
}